G-Intersecting Families
نویسندگان
چکیده
Let G be a graph on vertex set [n], and for X [n] let N(X) be the union of X and it's neighborhood in G. A family of sets F 2 is G-intersecting if N(X) \ Y 6= ; for all X;Y 2 F . In this paper we study the cardinality and structure of the largest k-uniform G-intersecting families on a xed graph G.
منابع مشابه
Triangle-Intersecting Families of Graphs
A family of graphs F is triangle-intersecting if for every G,H ∈ F , G∩H contains a triangle. A conjecture of Simonovits and Sós from 1976 states that the largest triangle-intersecting families of graphs on a fixed set of n vertices are those obtained by fixing a specific triangle and taking all graphs containing it, resulting in a family of size 182 (n2). We prove this conjecture and some gene...
متن کاملIntersecting families of permutations and partial permutations
The above result motivated the study of intersecting families of permutations which was initiated by Deza and Frankl, see [2]. Let Sn be the symmetric group on [n], that is the group of all permutations of [n]. For a positive integer t, a subset A of Sn is said to be t-intersecting if, for any g, h ∈ A with g 6= h, we have |{x : g(x) = h(x)}| ≥ t. By an intersecting family, we mean an 1-interse...
متن کاملHow Different Can Two Intersecting Families Be?
To measure the difference between two intersecting families F ,G ⊆ 2[n] we introduce the quantity D(F ,G) = |{(F,G) : F ∈ F , G ∈ G, F ∩ G = ∅}|. We prove that if F is k-uniform and G is l-uniform, then for large enough n and for any i 6= j Fi = {F ⊆ [n] : i ∈ F, |F | = k} and Fj = {F ⊆ [n] : j ∈ F, |F | = l} form an optimal pair of families (that is D(F ,G) ≤ D(Fi,Fj) for all uniform and inter...
متن کاملAlmost Cross-Intersecting and Almost Cross-Sperner Pairs of Families of Sets
For a set G and a family of sets F let DF (G) = {F ∈ F : F ∩ G = ∅} and SF (G) = {F ∈ F : F ⊆ G or G ⊆ F}. We say that a family is l-almost intersecting, (≤ l)-almost intersecting, l-almost Sperner, (≤ l)-almost Sperner if |DF (F )| = l, |DF (F )| ≤ l, |SF (F )| = l, |SF (F )| ≤ l (respectively) for all F ∈ F . We consider the problem of finding the largest possible family for each of the above...
متن کاملOn cross-intersecting families
Frankl, P., On cross-intersecting families, Discrete Mathematics 108 (1992) 291-295. Let n 3 t z 1 be integers. Let 9, YI be families of subsets of the n-element set X. They are called cross t-intersecting if IF n GI 2 t holds for all F E 9 and G E 3. If 9 = CfI then 9 is called t-intersecting. Let m(n, t) denote the maximum possible cardinality of a r-intersecting family. Our main result says ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Combinatorics, Probability & Computing
دوره 10 شماره
صفحات -
تاریخ انتشار 2001